Blind signal separation using fixed overcomplete basis function dictionaries
نویسندگان
چکیده
A solution for achieving blind separation for underdetermined systems is to use an overcomplete basis function set that has the ability to span all possible inputs. Ideally, such a basis would be learned for each set of inputs but this is computationally expensive. A less processor intensive system is shown using a fixed dictionary of basis functions learned from existing sources and reduced using a correlation-based method. The relation between dictionary size and separation performance for underdetermined scenarios is examined and we demonstrate that a reduced dictionary can produce comparable results using less computational power.
منابع مشابه
Learning Overcomplete Representations
In an overcomplete basis, the number of basis vectors is greater than the dimensionality of the input, and the representation of an input is not a unique combination of basis vectors. Overcomplete representations have been advocated because they have greater robustness in the presence of noise, can be sparser, and can have greater flexibility in matching structure in the data. Overcomplete code...
متن کاملExtraction of a source from multichannel data using sparse decomposition
It was discovered recently that sparse decomposition by signal dictionaries results in dramatic improvement of the qualities of blind source separation. We exploit sparse decomposition of a source in order to extract it from multidimensional sensor data, in applications where a rough template of the source is known. This leads to a convex optimization problem, which is solved by a Newton-type m...
متن کامل14 Sparsification for Monaural Source Separation
We explore the use of sparse representations for separation of a monaural mixture signal, where by a sparse representation we mean one where the number of non-zero elements is smaller than might be expected. This is a surprisingly powerful idea, as the ability to express a signal sparsely in some known, and potentially overcomplete, basis constitutes a strong model, while also lending itself to...
متن کاملSparse Representation and Its Applications in Blind Source Separation
In this paper, sparse representation (factorization) of a data matrix is first discussed. An overcomplete basis matrix is estimated by using the K−means method. We have proved that for the estimated overcomplete basis matrix, the sparse solution (coefficient matrix) with minimum l−norm is unique with probability of one, which can be obtained using a linear programming algorithm. The comparisons...
متن کاملA Histogram-based Overcomplete Ica Algorithm
Overcomplete blind source separation (BSS) tries to recover more sources from less sensor signals. We present a new approach based on an estimated histogram of the sensor data; we search for the points fulfilling the overcomplete Geometric Convergence Condition, which has been shown to be a limit condition of overcomplete geometric BSS [1]. The paper concludes with an example and a comparison o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003